The automorphism group of a free group is not linear

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence Subgroups of the Automorphism Group of a Free Group

Let n ≥ 2 and Fn be the free group of rank n. Its automorphism group Aut(Fn) has a well-known surjective linear representation ρ : Aut(Fn) −→ Aut(Fn/F ′ n) = GLn(Z) where F ′ n denotes the commutator subgroup of Fn. By Aut (Fn) := ρ(SLn(Z)) we denote the special automorphism group of Fn. For an epimorphism π : Fn → G of Fn onto a finite group G we call Γ(G, π) := {φ ∈ Aut(Fn) | πφ = π} the stan...

متن کامل

The Automorphism Tower of a Free Group

We prove that the automorphism group of any non-abelian free group F is complete. The key technical step in the proof: the set of all conjugations by powers of primitive elements is first-order parameter-free definable in the group Aut(F ). Introduction In 1975 J. Dyer and E. Formanek [2] had proved that the automorphism group of a finitely generated non-abelian free group F is complete (that i...

متن کامل

Countable Structure Does Not Have a Free Uncountable Automorphism Group

It is proved that the automorphism-group of a countable structure cannot be a free uncountable groupi. The idea is that instead proving that every countable set of equations of a certain form has a solution, we prove that this holds for a co-meagre family of appropriate countable sets of equations. Can a countable structure have an automorphism group, which a free uncountable group? This was a ...

متن کامل

The Kernel of the Magnus Representation of the Automorphism Group of a Free Group Is Not Finitely Generated

In this paper, we show that the abelianization of the kernel of the Magnus representation of the automorphism group of a free group is not finitely generated.

متن کامل

THE AUTOMORPHISM GROUP OF FINITE GRAPHS

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1992

ISSN: 0021-8693

DOI: 10.1016/0021-8693(92)90029-l